An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $\alpha({G}) \le 3$
نویسندگان
چکیده
In this paper we show how to solve the Maximum Weight Stable Set Problem in a claw-free graph G(V,E) with α(G) ≤ 3 in time O(|E| log |V |). More precisely, in time O(|E|) we check whether α(G) ≤ 3 or produce a stable set with cardinality at least 4; moreover, if α(G) ≤ 3 we produce in time O(|E| log |V |) a maximum stable set of G. This improves the bound of O(|E||V |) due to Faenza et alii ([2]).
منابع مشابه
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs
A claw-free graph G(V,E) is said to be basic if there exists a matching M ⊆ E whose edges are strongly bisimplicial and such that each connected component C of G − M is either a clique or a {claw, net}-free graph or satisfies α(G[C \ V (M)]) ≤ 3. The Maximum Weight Stable Set (MWSS) Problem in a basic claw-free graph can be easily solved by first solving at most four MWSS problems in each conne...
متن کاملAn ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$
In this paper we show that a connected {claw, net}-free graph G(V,E) with α(G) ≥ 4 is the union of a strongly bisimplicial clique Q and at most two cliquestrips. A clique is strongly bisimplicial if its neighborhood is partitioned into two cliques which are mutually non-adjacent and a clique-strip is a sequence of cliques {H0, . . . , Hp} with the property that Hi is adjacent only to Hi−1 and H...
متن کاملAn algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphsthat runs in O(n)−time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given...
متن کاملAn algorithmic decomposition of claw-free graphs leading to an O(n)-algorithm for the weighted stable set problem
We propose an algorithm for solving the maximumweighted stable set problem on claw-free graphsthat runs in O(n3)−time, drastically improving theprevious best known complexity bound. This algo-rithm is based on a novel decomposition theoremfor claw-free graphs, which is also introduced in thepresent paper. Despite being weaker than the wellknown structure result for claw-...
متن کاملOn Stable Cutsets in Claw-Free Graphs and Planar Graphs
A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K4 and K1,3 (claw) denote the complete (bipartite) graph on 4 and 1+ 3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) with maximum degree five or a K4-free graph admits a stable cutset. Here we describe algorithms deciding in polynomial time whether a claw-free gr...
متن کامل